A novel type of branch and bound for maximum independent set
نویسنده
چکیده
Several algorithms are presented. The standard algorithm generates all N anticliques of a graph G with v vertices in time O(Nv). It can e.g. be adapted to calculate the independence polynomial of G, to generate all maximum cardinality anticliques, or just one maximum anticlique. The latter was programmed using the Mathematica 6.0 code. For a random (45, 92)-graph G a maximum anticlique of size 21 was found in 1.344 sec, whereas the “hardwired” Mathematica command MaximumIndependentSet[G] clocked in at 155838 sec, which is five orders of magnitude slower.
منابع مشابه
A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملA Novel Type-2 Adaptive Neuro Fuzzy Inference System Classifier for Modelling Uncertainty in Prediction of Air Pollution Disaster (RESEARCH NOTE)
Type-2 fuzzy set theory is one of the most powerful tools for dealing with the uncertainty and imperfection in dynamic and complex environments. The applications of type-2 fuzzy sets and soft computing methods are rapidly emerging in the ecological fields such as air pollution and weather prediction. The air pollution problem is a major public health problem in many cities of the world. Predict...
متن کاملCombinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem
We describe three combinatorial branch-and-bound solvers for the maximum weight independent set problem. All use weighted clique covers to generate upper bounds, and all branch according to the method of Balas and Yu (1986). One extends and speeds up the method of Babel (1994). A second one employs a modified method from Balas and Yu (1986) to produce clique covers that share structural similar...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملAverage-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model
Average-case complexity of a branch-and-bound algorithm for max independent set, under the G(n, p) random model Abstract We study average-case complexity of branch-and-bound for max independent set in random graphs under the G(n, p) distribution. In this model every pair (u, v) of vertices belongs to E with probability p independently on the existence of any other edge. We make a precise case a...
متن کامل